A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem
نویسندگان
چکیده
An original parallel algorithm is presented that stems from a suitable physical metaphor by considering each edge of the graph as a cell that is attracted by the corresponding vertices and finally moves towards the one of them that wins the competition.
منابع مشابه
An Effective Algorithm for Minimum Weighted Vertex Cover Problem
The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Sup...
متن کاملMinimum Vertex Cover in Rectangle Graphs
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families R where R1 \ R2 is connected for every pair of rectangles R1, R2 ∈ R. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of (1.5 + ...
متن کاملImproved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover
This paper studies a combination of parallel machine scheduling and the vertex cover problem. Given some weighted vertices in an undirected graph, a set of vertices is called a vertex cover if for each edge at least one endpoint belongs to this set. Our problem is to schedule a set of weighted vertices on m identical parallel machines such that the set of vertices is a vertex cover and the make...
متن کاملComputing a Tree Having a Small Vertex Cover
We consider a new Steiner tree problem, called vertex-cover-weighted Steiner tree problem. This problem defines the weight of a Steiner tree as the minimum weight of vertex covers in the tree, and seeks a minimum-weight Steiner tree in a given vertex-weighted undirected graph. Since it is included by the Steiner tree activation problem, the problem admits an O(logn)-approximation algorithm in g...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 53 شماره
صفحات -
تاریخ انتشار 1995